Attribute value weighting in k-modes clustering
نویسندگان
چکیده
منابع مشابه
Attribute Value Weighting in K-Modes Clustering
In this paper, the traditional k-modes clustering algorithm is extended by weighting attribute value matches in dissimilarity computation. The use of attribute value weighting technique makes it possible to generate clusters with stronger intra-similarities, and therefore achieve better clustering performance. Experimental results on real life datasets show that these value weighting based k-mo...
متن کاملOn Attribute Weighting in Value Trees
Preface The work for this thesis has been carried out at Systems Analysis Laboratory at Helsinki University of Technology. I want to express my warmest thanks to my thesis supervisor, professor Raimo P. Hämäläinen, for his dynamic way to supervise me. I learned a lot during these years. It was a great pleasure to collaborate with Dr. Ahti Salo and Dr. Hans C. Vrolijk. Ahti provided me a good st...
متن کاملAn Optimization K-Modes Clustering Algorithm with Elephant Herding Optimization Algorithm for Crime Clustering
The detection and prevention of crime, in the past few decades, required several years of research and analysis. However, today, thanks to smart systems based on data mining techniques, it is possible to detect and prevent crime in a considerably less time. Classification and clustering-based smart techniques can classify and cluster the crime-related samples. The most important factor in the c...
متن کاملImproving categorical data clustering algorithm by weighting uncommon attribute value matches
This paper presents an improved Squeezer algorithm for categorical data clustering by giving greater weight to uncommon attribute value matches in similarity computations. Experimental results on real life datasets show that, the modified algorithm is superior to the original Squeezer algorithm and other clustering algorithm with respect to clustering accuracy.
متن کاملA weighting k-modes algorithm for subspace clustering of categorical data
Traditional clustering algorithms consider all of the dimensions of an input data set equally. However, in the high dimensional data, a common property is that data points are highly clustered in subspaces, which means classes of objects are categorized in subspaces rather than the entire space. Subspace clustering is an extension of traditional clustering that seeks to find clusters in differe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Expert Systems with Applications
سال: 2011
ISSN: 0957-4174
DOI: 10.1016/j.eswa.2011.06.027